The Majority Strategy on Graphs
نویسنده
چکیده
In a tree one can find the median set of a profile simply by starting at an arbitrary vertex and then moving to the majority of the profile. This strategy is formulated for arbitrary graphs. The graphs for which this strategy produces always the median set M(E), for each profile 7t, are precisely the median graphs. AMS C/ass$cication: Primary: 05C12,OSC75,05C99; secondary: 90B80
منابع مشابه
Median computation in graphs using consensus strategies
Following the Majority Strategy in graphs, other consensus strategies, namely Plurality Strategy, Hill Climbing and Steepest Ascent Hill Climbing strategies on graphs are discussed as methods for the computation of median sets of profiles. A review of algorithms for median computation on median graphs is discussed and their time complexities are compared. Implementation of the consensus strateg...
متن کاملThe plurality strategy on graphs
Goldman [Transportation Science 5 (1971), 212–221] proved the classical result on how to find the medians for a set of clients in a tree using majority rule. Here the clients are located at vertices of the tree, and a median is a vertex in the tree that minimizes the sum of the distances to the locations of the clients. The majority rule can be rephrased as the Majority Strategy: if we are at v...
متن کاملترکیب بهینه استراتژی، سبک مدیریت، و اثربخشی در شرکت‌های دولتی
The present study is conducted in tanderm with objectives set out in Iran's Third Development Plan and follows up on studies by such researchers as Chandler (1962,Strategy and Structure), David (1999, Strategy and Environment), Deghat (1998, Strategy and Efficient Management), Robins (1990, Organization Success) and others, all of whom have worked on concepts such as efficiency, strategy, manag...
متن کاملLearning Unknown Graphs
Motivated by a problem of targeted advertising in social networks, we introduce and study a new model of online learning on labeled graphs where the graph is initially unknown, and the algorithm is free to choose the next vertex to predict. After observing that natural nonadaptive exploration/prediction strategies (like depth-first with majority vote) badly fail on simple binary labeled graphs,...
متن کاملL2 Learners’ Strategy Preference in Metaphorical Test Performance: Effects of Working Memory and Cognitive Style
Although investigating the factors that influence test scores is important, a majority of stakeholders show a paucity of attention towards individual learner differences due to having large classes of L2 learners. This study sought to explore the possible effect of working memory and cognitive style on L2 learners’ metaphorical test performance. The study was conducted in 2 phases. The first ph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 80 شماره
صفحات -
تاریخ انتشار 1997